A Lagrangian Relaxation Method for Approximating the Analytic Center of a Polytope
نویسندگان
چکیده
The analytic center of a polytope P fx Ax b ex g is characterized by a saddle point condition min y R max x S g x y max x S min y R g x y on the Lagrangian function
منابع مشابه
Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملLagrangian Relaxation Method for the Step fixed-charge Transportation Problem
In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...
متن کاملA Conjugate Direction Method for Approximating the Analytic Center of a Polytope
The analytic center of an n dimensional polytope P fx R aTi x bi i m g with a nonempty interior Pint is de ned as the unique minimizer of the logarithmic potential function F x Pmi log aTi x bi over Pint It is shown that one cycle of a conjugate direction method applied to the potential function at any v Pint such that q v Tr F v generates a point x Pint such that q x Tr F x pn
متن کاملProximal ACCPM, a cutting plane method for column generation and Lagrangian relaxation: application to the p-median problem
Proximal ACCPM is a variant of the analytic center cutting plane method, in which a proximal term is added to the barrier function that defines the center. The present paper gives a detailed presentation of the method and of its implementation. Proximal ACCPM is used to solve the Lagrangian relaxation of the p-median problem on two sets of problem instances. Problems of the same collection are ...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992